Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

Stochastic scheduling subject to machine breakdowns: The preemptive‐repeat model with discounted reward and other criteria

We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

一种时频混叠的欠定混合通信信号盲分离算法

针对衰减-延迟欠定混合通信信号的盲分离问题,提出了一种基于子空间最小距离的源信号估计算法,通过计算观测信号到混合矩阵列矢量张成子空间的距离,估计任意时频点同时存在的源信号数目以及当前源信号对应的混合矩阵列矢量,把欠定混合问题转化为超定问题,然后通过计算Moore-Penrose逆矩阵求解源信号,理论分析和仿真结果验证了算法的有效性。     

Machine scheduling with pickup and delivery

The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

一种新型内曲线式径向柱塞泵的设计

讨论了各种液压泵的使用特点,提出了一种新型内曲线式径向柱塞泵的设计思路.通过合理设计泵内定子内曲线表面,在理论上实现了无流量脉动;为了提高柱塞泵的使用寿命,采取了降低定子导轨压力角的措施;通过Matlab实现了定子表面曲线和压力角的仿真计算;理论分析的结果对于设计和制造低噪声的柱塞式液压泵有一定的指导意义.     

Impacts of logistics information on sales: Evidence from Alibaba

Facing fierce competition from rivals, sellers in online marketplaces are eager to improve their sales by delivering items faster and more reliably. Because logistics quality can be known only after a transaction, sellers must identify effective ways to communicate logistics information to consumers. Drawing on the accessibility-diagnosticity framework, we theorize that the sales impacts of logistics information depend on its relative diagnostic value. Using data on 1493 items with 505,785 consumer reviews from an online marketplace, we examine how sales are affected by three information sources for logistics services: online word of mouth (WOM) about logistics, self-reported logistics services, and expected delivery time. We use an instrumental variable method to address the endogeneity issue between sales and WOM. We find that, ceteris paribus, consumers give more weight to WOM about logistics and delivery time when they make purchase decisions but less weight to self-reported logistics service. The effects of logistics information on sales are asymmetric for large and small sellers.     

Inventory control and replenishment with flexible delivery‐time upgrade

We consider a capacitated inventory model with flexible delivery upgrades, in which the seller allocates its on‐hand inventory to price‐ and delivery‐time‐sensitive customers. The seller has two decisions: inventory commitment and replenishment. The former addresses how the on‐hand inventories are allocated between the two classes of customers within an inventory cycle. The latter addresses how the inventory is replenished between inventory cycles. We develop optimal inventory allocation, upgrade, and replenishment policies and demonstrate that the optimal policy can be characterized by a set of switching curves. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 418–426, 2014     

电磁辐射对桥丝式电火工品性能影响研究

利用传导方法研究射频对桥丝式电火工品的桥丝电阻、烤爆、迟发火以及瞎火等性能影响。研究结果表明,在10％发火功率和0．4MHz的敏感频率条件下,所研究的3种电火工品在照射1～5min后,电阻增加1.2％～7．4％,并且17．3％的试样在照射的过程中出现了烤爆;在对经过照射后的试样进行正常的发火感度试验中,发火时间显著增加,出现了不同程度的迟发火,16．9％的试样瞎火。     

考虑单群缓发中子时中子增殖的统一公式

迄今为止,人们只分别导出了深度次临界、缓发临界附近和瞬发超临界的几个特定条件下的中子增殖公式,各公式都不具有通用性,使用很不便.文中导出了反应性阶跃变化时,只考虑单群缓发中子从深度次临界直到缓发超临界整个区间上的中子增殖统一公式.实例计算表明,该公式计算准确,实用性强,具有重要的理论意义与应用价值.     

基于动态贝叶斯网的炮兵战斗效果评估建模仿真

依据炮兵火力作战的特点规律,分析炮兵战斗效果评估的内容、程序、建模过程和影响因素,运用动态Bayesian网建立炮兵战斗效果评估模型,运用主成分分析方法确定评估专家权重,运用Poly Tree的消息传递算法进行评估网络推理分析,最后结合案例仿真验证。结果表明,该研究解决了情报信息不确定性、模糊性和动态性等影响战斗效果精确评估问题。